Exact Blind Community Detection From Signals on Multiple Graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Community Detection on Evolving Graphs

Clustering is a fundamental step in many information-retrieval and data-mining applications. Detecting clusters in graphs is also a key tool for finding the community structure in social and behavioral networks. In many of these applications, the input graph evolves over time in a continual and decentralized manner, and, to maintain a good clustering, the clustering algorithm needs to repeatedl...

متن کامل

Blind Detection of Psk Signals

In this paper, a blind detection method is proposed to evaluate the information that can be drawn from the received phase shift keying (PSK) signals without channel knowledge at the receiver. First, we develop a method to determine the decision regions for detecting PSK symbols based on the maximum a posterior (MAP) criterion. Then, to reduce the numerical complexity, an approximated MAP criter...

متن کامل

Community detection in graphs

The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i.e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, ...

متن کامل

Exact estimation of multiple directed acyclic graphs

Abstract. This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the vertices in each DAG share a common ordering. Furthermore, we allow al...

متن کامل

Context Selection on Attributed Graphs for Outlier and Community Detection

English Version) Today’s applications store large amounts of complex data that combine information of different types. In particular, attributed graphs are an example for such a complex database. They are widely used for the representation of social networks, gene and protein interactions, communication networks or product co-purchase in web stores. Each object is characterized by its relations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2020

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2020.3016494